Block Allocation in Video Servers for Availability and Throughput

نویسندگان

  • February
  • William Tetzlaff
  • Robert Flynn
چکیده

ii Abstract Video servers aimed at the home market must deliver very large files at a low cost. The video files must be shared and reused to contain costs. The nature of videos, however, demand a low jitter (late block delivery) rate. Normal systems tolerate disk queues and deliver, typically, smaller objects in a less predictable manner. This paper explores in a multi disk, stripped, enviornment whether block placement, interdisk permuation, replication and compression impacts the rate of jitter in a multiuser setting with different assumptions as to the pattern of use. Correspondingly, the number of supportable users for a given level of quality (jitters per hour per user) is addressed. Block allocation is the term used to describe the placement of video blocks on selected disk(s).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis and Modeling of VoIP Servers: A Linear Programming Approach

The SIP protocol was standardized by the IETF at the application layer for initiating, managing, and terminating multimedia sessions and has been widely used as the main signaling protocol on both the Internet and VoIP networks. Most challenges in this protocol are overload and lack of proper state distribution. These challenges cause a wide range of next-generation network users to face a shar...

متن کامل

ارزیابی سیاست‌های زمان‌بندی در نسل چهارم شبکه‌های سلولی (LTE)

New generation of wireless networks, LTE and WiMAX, supports many services which consume a lot of resources (such as VOIP, Video Conference, Digital Video, Multimedia streams and online Multi-player Games). Supporting multi-media services in wireless communication systems provide new resource allocation challenges. Because of high loads in downlink, efficient resource allocation is vital in dow...

متن کامل

Vacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery

Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (seco...

متن کامل

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

Efficient Resource Allocation in a Distributed

461 Abstract—This paper proposes an efficient bandwidth allocation algorithm in which higher priority is given to the videos with higher weights using agent technology. The popularity and weight profile of the videos which is used for efficiently allocating bandwidth is periodically updated by a mobile agent. The proposed approach allocates more bandwidth for higher weight videos [popular video...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996